FCT '97 : fundamentals of computation theory (Krakow, September 1-3, 1997)Chlebus, Bogdan S; Czaja, Ludwik.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63386-3, XI, 474 p, isbn 3-540-63386-3Conference Proceedings

On an optimal quantified propositional proof system and a complete language for NP ∩ co-NPSADOWSKI, Z.Lecture notes in computer science. 1997, pp 423-428, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Locally computable enumerationsMAZURKIEWICZ, A.Lecture notes in computer science. 1997, pp 51-66, issn 0302-9743, isbn 3-540-63386-3Conference Paper

The complexity of error-correcting codesSPIELMAN, D. A.Lecture notes in computer science. 1997, pp 67-84, issn 0302-9743, isbn 3-540-63386-3Conference Paper

A two-dimensional hierarchy for attributed tree transducersKÜHNEMANN, A.Lecture notes in computer science. 1997, pp 281-292, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Distributed acyclic orientation of asynchronous anonymous networksCALABRESE, A.Lecture notes in computer science. 1997, pp 129-137, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Lower bounds in on-line geometric searchingSCHUIERER, S.Lecture notes in computer science. 1997, pp 429-440, issn 0302-9743, isbn 3-540-63386-3Conference Paper

On occurrence net semantics for Petri nets with contactsLOMAZOVA, I. A.Lecture notes in computer science. 1997, pp 317-328, issn 0302-9743, isbn 3-540-63386-3Conference Paper

On the average complexity of the membership problem for a generalized Dyck languageNEBEL, M. E.Lecture notes in computer science. 1997, pp 352-363, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteriaHERTRAMPF, U.Lecture notes in computer science. 1997, pp 233-244, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Bounded concurrencyGRUSKA, D. P.Lecture notes in computer science. 1997, pp 198-209, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Cellular automata universality revisitedMARTIN, B.Lecture notes in computer science. 1997, pp 329-339, issn 0302-9743, isbn 3-540-63386-3Conference Paper

The equivalence of pebbles and sensing heads for finite automataPETERSEN, H.Lecture notes in computer science. 1997, pp 400-410, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Unique normal forms for nonlinear term rewriting systems : Root overlapsVERMA, R. M.Lecture notes in computer science. 1997, pp 452-462, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Centralized asynchronous broadcast in radio networksCHLEBUS, Bogdan S; ROKICKI, Mariusz A.Theoretical computer science. 2007, Vol 383, Num 1, pp 5-22, issn 0304-3975, 18 p.Conference Paper

Time and communication efficient consensus for crash failuresCHLEBUS, Bogdan S; KOWALSKI, Dariusz R.Lecture notes in computer science. 2006, pp 314-328, issn 0302-9743, isbn 3-540-44624-9, 1Vol, 15 p.Conference Paper

Many-to-Many Communication in Radio NetworksCHLEBUS, Bogdan S; KOWALSKI, Dariusz R; RADZIK, Tomasz et al.Algorithmica. 2009, Vol 54, Num 1, pp 118-139, issn 0178-4617, 22 p.Article

A note on broadcasting with linearly bounded transmission faults in constant degree networksCIEBIERA, K; MALINOWSKI, A.Lecture notes in computer science. 1997, pp 150-156, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Behavioural characterizations of partial order logicsVIRBITSKAITE, I; VOTINTSEVA, A.Lecture notes in computer science. 1997, pp 463-474, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Efficient parallel computing with memory faultsGASIENIEC, L; INDYK, P.Lecture notes in computer science. 1997, pp 188-197, issn 0302-9743, isbn 3-540-63386-3Conference Paper

From finite automata toward hybrid systemsRABINOVICH, A; TRAKHTENBROT, B. A.Lecture notes in computer science. 1997, pp 411-422, issn 0302-9743, isbn 3-540-63386-3Conference Paper

The complexity class Θ₂^p : Recent results and applications in AI and modal logicEITER, T; GOTTLOB, G.Lecture notes in computer science. 1997, pp 1-18, issn 0302-9743, isbn 3-540-63386-3Conference Paper

A linear-time heuristic for minimum rectangular coveringsLEVCOPOULOS, C; GUDMUNDSSON, J.Lecture notes in computer science. 1997, pp 305-316, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Concerning the time bounds of existing shortest watchman route algorithmsHAMMAR, M; NILSSON, B. J.Lecture notes in computer science. 1997, pp 210-221, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Trade-off results for connection managementMAVRONICOLAS, M; PAPADAKIS, N.Lecture notes in computer science. 1997, pp 340-351, issn 0302-9743, isbn 3-540-63386-3Conference Paper